//给你一个数组 nums ，数组中有 2n 个元素，按 [x1,x2,...,xn,y1,y2,...,yn] 的格式排列。
//请你将数组按 [x1,y1,x2,y2,...,xn,yn] 格式重新排列，返回重排后的数组。
//
//示例 1：
//
//输入：nums = [2,5,1,3,4,7], n = 3
//输出：[2,3,5,4,1,7]
//解释：由于 x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 ，所以答案为 [2,3,5,4,1,7]

package main

import "fmt"

func shuffle(nums []int, n int) []int {
	var one []int
	var two []int
	var three []int
	total := len(nums)
	one = nums[:total/2]
	two = nums[total/2:]

	for i := 0; i < len(one); i++ {
		three = append(three, one[i])
		fmt.Println(two[i])
		three = append(three, two[i])
	}
	return three
}

func main() {
	nums := []int{1, 1, 2, 2}
	n := 2
	res := shuffle(nums, n)
	fmt.Println(res)
}
